Congestion games revisited

نویسنده

  • Nikolai S. Kukushkin
چکیده

Strategic games are considered where the players derive their utilities from participation in certain “processes.” Two subclasses consisting exclusively of potential games are singled out. In the first, players choose where to participate, but there is a unique way of participation, the same for all players. In the second, the participation structure is fixed, but each player may have an arbitrary set of strategies. In both cases, the players sum up the intermediate utilities; thus the first class essentially coincides with that of congestion games. The necessity of additivity in each case is proven.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Congestion Games with Player-Specific Costs Revisited

We study the existence of pure Nash equilibria in congestion games with player-specific costs. Specifically, we provide a thorough characterization of the maximal sets of cost functions that guarantee the existence of a pure Nash equilibrium. For the case that the players are unweighted, we show that it is necessary and sufficient that for every resource and for every pair of players the corres...

متن کامل

Congestion Games, Player-Specific Congestion Games and Weighted Congestion Games for Radio Resource Management in Wireless Networks

The goal of this report is two-fold: Firstly, we present a short introduction on congestion games, a class of non-cooperative games that have received considerable attention by the research community during the last years. We discuss their properties and present their two most prominent extensions, namely weighted congestion games and player-specific congestion games. Secondly, we discuss appli...

متن کامل

Nash Dynamics in Constant Player and Bounded Jump Congestion Games

We study the convergence time of Nash dynamics in two classes of congestion games – constant player congestion games and bounded jump congestion games. It was shown by Ackermann and Skopalik [2] that even 3-player congestion games are PLS-complete. We design an FPTAS for congestion games with constant number of players. In particular, for any > 0, we establish a stronger result, namely, any seq...

متن کامل

Strong and Correlated Strong Equilibria in Monotone Congestion Games

The study of congestion games is central to the interplay between computer science and game theory. However, most work in this context does not deal with possible deviations by coalitions of players, a significant issue one may wish to consider. In order to deal with this issue we study the existence of strong and correlated strong equilibria in monotone congestion games. Our study of strong eq...

متن کامل

Pure Nash Equilibria in Player-Specific and Weighted Congestion Games

Unlike standard congestion games, weighted congestion games and congestion games with player-specific delay functions do not necessarily possess pure Nash equilibria. It is known, however, that there exist pure equilibria for both of these variants in the case of singleton congestion games, i. e., if the players’ strategy spaces contain only sets of cardinality one. In this paper, we investigat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Game Theory

دوره 36  شماره 

صفحات  -

تاریخ انتشار 2007